Fast iterative algorithms for birefringent filter design
نویسندگان
چکیده
منابع مشابه
Fast order-recursive algorithms for optimal stack filter design
For the nonlinear classes of filters based on the median archetype, e.g. stack, Weighted Order Statistics (WOS), morphological filters the techniques exploiting recursiveness of embedded structures were not used yet. We investigate in this paper the possibilities of improving the speed of the optimal design techniques restating the optimal design problem as a sequence of optimal problems for em...
متن کاملAlgorithms for Optimal Multirate Filter Bank Design
This paper is concerned with the problem of designing optimal multirate lter banks. Three design criteria are considered for linear phase FIR lter banks: H 2 measure, H 1 and the mixture of them. A closed-form solution is presented for optimal H 2 lter bank design. For optimal H 1 lter bank design, two algorithms are given which involve solving the design problem using positive semi-deenite pro...
متن کاملFast Iterative Subspace Algorithms for Airborne STAP Radar
Space-time adaptive processing (STAP) is a crucial technique for the new generation airborne radar for Doppler spread compensation caused by the platform motion. We here propose to apply range cell snapshots-based recursive algorithms in order to reduce the computational complexity of the conventional STAP algorithms and to deal with a possible nonhomogeneity of the data samples. Subspace track...
متن کاملSparsening filter design for iterative soft-input soft-output detectors
A large body of research exists around the idea of channel shortening, where a prefilter is designed to reduce the effective channel impulse response to some smaller number of contiguous taps. This idea was originally conceived to reduce the complexity of Viterbi-based maximum-likelihood equalizers. Here, we consider a generalization of channel shortening which we term “channel sparsening”. In ...
متن کاملFast search algorithms for computational protein design
One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state-of-the-art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitude...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computing and Informatics
سال: 2020
ISSN: 2634-1964,2210-8327
DOI: 10.1016/j.aci.2018.08.004